MTPM—一种在多Transputer系统上实现OPS5并行匹配的方案

并行匹配是并行处理产生式系统的重要内容之一。本文针对现有RETE匹配算法,提出了一种自行设计的在多Transputer系统上实现OPS5并行匹配的方案,并重点讨论了实现MTPM中的一些技术问题.试验表明,MTPM提供了一条发掘产生式系统固有并行性的可能途径.     

基于集群计算机的保护定值在线校核

采用分布式计算技术，研究并实现了基于集群计算机的保护定值在线校核并行计算方法。首先分析了保护定值校核计算的计算量和计算特点，接着对可能采用的并行计算方法进行比较，最后选择了基于电网分块的并行计算方法。采用协调机加计算子机的计算模式，在协调机上执行分块算法，通过基于主导节点的图划分方法把电网分成几块，每台计算子机只校核1块电网内的保护定值，最后由协调机收集汇总计算结果。现场应用证明，该并行计算方法正确、有效。     

多级并接型权电阻DAC的设计

多级并接型权电阻解码网络结构简单，分析方便，文章给出了普通的和BCD码多级并接型权电阻解码网络，推导出了各级与运放的连接电阻的通用公式，并用EWB软件进行了电路模拟，这种方法对自行设计权电阻DAC有一定的参考价值。     

微分代数方程的一类并行算法

本文提出求解微分代数方程的一类并行算法,进行误差估计。对于一个模型问题进行稳定性分析,画出稳定区域。计算实例表明算法是有效的。     

新型可调剪切差平行分束偏光器设计

本文给出了一种新型可调的切差平行分束偏光器设计。它调节方便,可获得较大平行分束剪切差,并可一镜多用     

一种网格结构的雷达信号处理单元

介绍了一种采用网络结构，使用五片SHARC芯片组成的相控阵雷达信号处理单元。并介绍了此单元上基于IEEE1149.1边界扫描标准的故障诊断系统。     

化工领域中对流传热系数α的计算

对流传热是热传递的三种基本方式之一,化学工程中的对流传热并非单纯对流而是流体流过固体表面时发生的对流和传导联合作用的传热过程。描述对流传热速率的方程式形式简单,所有问题集中在对流传热系数α中。因此对流传热系数α的计算是对流传热过程的关键。     

无功功率的补偿方法

介绍采用同步电动机和并联电容器进行无功补偿等常用的无功功率补偿方法，以提高用电设备的功率因数。     

Tradeoffs in granularity and parallelization for a Monte Carlo shower simulation code

The EGS4 code, developed at Stanford Linear Accelerator Center, simulates electron-photon cascading phenomena. The original code is inherently sequential: processing one particle at a time. This paper reports on a series of experiments in parallelizing different versions of EGS4. Our parallel experiments were run on a 30-processor Sequent Balance B21 and a 6-processor Symmetry S27. We have considered the following approaches for parallel execution of this application code:

1. (1) Original sequential version modified for parallel processing: 1 processor;

2. (2) Version 1 run multiprocessed: 1 to 29 processors;

3. (3) Sequential version modified for large-grain parallel processing: 1 procssor;

4. (4) Version 3 run using the Sequent Microtasking Library: 1 to 29 processors.

For each approach, we discuss the relative advantages and disadvantages in the areas of coding effort, understandability and portability, as well as performance, and outline a new parallelization approach we are currently pursuing based on Large-Grain Data Flow techniques.     

The Lazy Cook Problem, or Scheduling Two Parallel Machines to Optimize Vehicle Utilization

A cook has to prepare n cakes using an oven with two racks. According to the recipe, the i-th cake has to be baked for exactly a _i minutes. Cakes to be cooked are taken from a table and carried to the oven, and once cooked are carried back to the table by means of a trolley that can carry two cakes at a time. What is the minimum number q ^* of round trips required of the cook? This problem has application to the operation scheduling of transportation systems and to material cutting. A different problem arises according to whether the cook accepts or not to stay near the oven for awhile with the trolley. If the trolley cannot be idle at the oven, an optimum schedule with no oven idle-time always exists: consequently, the trolley schedule is trivial, and the problem is transformed into a set packing. For this case, we propose and test a heuristic method which generates all of the promising columns of the set packing, and solves the resulting problem by branch-and-bound. Instead, if the trolley can be idle at the oven for a limited amount of time, a problem arises to find an optimal schedule of the trolley: in this case we show how to use a scaling technique in order to obtain a very good feasible solution by the method above.